Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups
نویسندگان
چکیده
We say a pair of integers (a, b) is findable if the following true. For any δ > 0 there exists p0 such that for prime p ≥ and red-blue colouring ℤ/pℤ in which each colour has density at least δ, we can find an arithmetic progression length + b inside whose first elements are red last blue. Szemeredi’s Theorem on progressions implies (0, k) (1, find-able k. prove (2, also However, same not true (3, k). Indeed, give construction showing (3,30000) findable. show (14, 14)
منابع مشابه
Finding Longest Arithmetic Progressions
We describe eÆcient output-sensitive algorithms to nd the longest arithmetic progression in a given set of numbers.
متن کاملPermutations Destroying Arithmetic Progressions in Finite Cyclic Groups
A permutation π of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a, b, c) is a non-trivial 3-term AP in G, that is c − b = b − a and a, b, c are not all equal, then (π(a), π(b), π(c)) is not an AP. In a paper from 2004, the first author conjectured that such a permutation exists of Zn, for all n 6∈ {2, 3, 5, 7}. Here we prove, as a special case of a more gene...
متن کاملPrime Numbers in Certain Arithmetic Progressions
We discuss to what extent Euclid’s elementary proof of the infinitude of primes can be modified so as to show infinitude of primes in arithmetic progressions (Dirichlet’s theorem). Murty had shown earlier that such proofs can exist if and only if the residue class (mod k ) has order 1 or 2. After reviewing this work, we consider generalizations of this question to algebraic number fields.
متن کاملRainbow Arithmetic Progressions in Finite Abelian Groups
For positive integers n and k, the anti-van der Waerden number of Zn, denoted by aw(Zn, k), is the minimum number of colors needed to color the elements of the cyclic group of order n and guarantee there is a rainbow arithmetic progression of length k. Butler et al. showed a reduction formula for aw(Zn, 3) = 3 in terms of the prime divisors of n. In this paper, we analagously define the anti-va...
متن کاملOn the Least Prime in Certain Arithmetic Progressions
We nd innnitely many pairs of coprime integers, a and q, such that the least prime a (mod q) is unusually large. In so doing we also consider the question of approximating rationals by other rationals with smaller and coprime denominators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2022
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-022-4901-x